Cryptographic Puzzles and Complex Systems
نویسندگان
چکیده
A puzzle lies behind password authentication (PA) and blockchain proof of work (PoW). cryptographic hash function is commonly used to implement them. The potential problem with secure functions their complexity rigidity. We explore the use complex systems constructs such as a cellular automaton (CA) provide functionality. analysis shows that computational irreducibility sensitivity initial state phenomena are enough create simple can be for PA PoW. Moreover, we present schemata using CA n-body problems.
منابع مشابه
On Chained Cryptographic Puzzles
Cryptographic puzzles provide an elegant solution in combating denial of services attacks. In this paper we introduce the concept of chained cryptographic puzzle. We define two kinds of chained puzzle constructions: linearly chained puzzles and randomly chained puzzles. The first construction prove to be very useful in some scenarios, from which the more general is in which a client may choose ...
متن کاملOn Cryptographic Chained Puzzles
Cryptographic puzzles provide an elegant solution in combating denial of services attacks. In this paper we introduce the concept of chained puzzles and we define two kinds of chained puzzles: linearly chained puzzles and randomly chained puzzles. These construnstions prove to be very useful in some scenarios, from which the more general is in which a client may choose to solve only some of the...
متن کاملCryptographic puzzles and DoS resilience, revisited
Cryptographic puzzles (or client puzzles) are moderately difficult problems that can be solved by investing non-trivial amounts of computation and/or storage. Devising models for cryptographic puzzles has only recently started to receive attention from the cryptographic community as a first step toward rigorous models and proofs of security of applications that employ them (e.g. Denial-of-Servi...
متن کاملBAP: Broadcast Authentication Using Cryptographic Puzzles
We present two broadcast authentication protocols based on delayed key disclosure. Our protocols rely on symmetric-key cryptographic primitives and use cryptographic puzzles to provide efficient broadcast authentication in different application scenarios, including those with resource-constrained wireless devices such as sensor nodes. The strong points of the protocols proposed are that one all...
متن کاملPseudonymous Broadcast and Secure Computation from Cryptographic Puzzles
In standard models of distributed computation, point-to-point channels between parties are assumed to be authenticated by some preexisting means. In other cases, even stronger pre-existing setup—e.g., a public-key infrastructure (PKI)—is assumed. These assumptions are too strong for open, peer-to-peer networks, where parties do not necessarily have any prior relationships and can come and go as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex Systems
سال: 2021
ISSN: ['0891-2513']
DOI: https://doi.org/10.25088/complexsystems.30.3.375